翻訳と辞書
Words near each other
・ Unserfrau-Altweitra
・ Unset
・ Unrest
・ Unrest (band)
・ Unrest (disambiguation)
・ Unrest (Erlend Øye album)
・ Unrest (film)
・ Unrest (Henry Cow album)
・ Unrest (Unrest album)
・ Unrest (video game)
・ Unrest in Gostivar and Tetovo (1997)
・ Unrestricted
・ Unrestricted (Da Brat album)
・ Unrestricted (Symphorce album)
・ Unrestricted domain
Unrestricted grammar
・ Unrestricted Hartree–Fock
・ Unrestricted Line Officer
・ Unrestricted submarine warfare
・ Unrestricted Warfare
・ UNRIC
・ Unriddle
・ Unriddle 2
・ Unriddle episodes
・ Unring the bell
・ Unrivaled
・ Unrivaled Belle
・ Unrockbar
・ Unrolled linked list
・ Unrooted binary tree


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Unrestricted grammar : ウィキペディア英語版
Unrestricted grammar
In formal language theory, an unrestricted grammar is a formal grammar on which no restrictions are made on the left and right sides of the grammar's productions. This is the most general class of grammars in the Chomsky–Schützenberger hierarchy, and can generate arbitrary recursively enumerable languages.
== Formal definition ==

An unrestricted grammar is a formal grammar G = (N, \Sigma, P, S), where N is a set of nonterminal symbols, \Sigma is a set of terminal symbols, N and \Sigma are disjoint (actually, this is not strictly necessary since unrestricted grammars make no real distinction between the two; the designation exists purely so that one knows when to stop generating sentential forms of the grammar), P is a set of production rules of the form \alpha \to \beta where \alpha and \beta are strings of symbols in N \cup \Sigma and \alpha is not the empty string, and S \in N is a specially designated start symbol. As the name implies, there are no real restrictions on the types of production rules that unrestricted grammars can have.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Unrestricted grammar」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.